搜索资源列表
2-76
- 求解大型疏松方程组，ap方程组的系数矩阵，b[放回解向量-For solving large loose equations, ap equations coefficient matrix, b [back into the solution vectors
ols
- 正交最小二乘辨识算法 该算法除了实现最小二乘辨识功能之外而且能按照各项重要性将其逐一选出并且估计相应系数-OLS Orthogonal Least Quares. [x, ind] = OLS(A,b,r) gives the solution to the least squares problem using only the best r regressors chosen from the ones present in matrix A. This
directed_network
- 以邻接矩阵的方式确定有向网，完成： A．建立并显示出它的邻接链表； B．以非递归方式进行深度优先遍历，显示遍历的结果，（并随时显示栈的入出情况）； C．对该图进行拓补排序，显示拓补排序的结果，并随时显示入度域的变化情况； D．给出某一确定顶点到所有其他顶点的最短路径-Adjacency matrix to determine a directed network, the completion of: A. To establish and demonstrate its adj
java4
- 利用随机数产生一个10行，10列的整型矩阵。完成如下操作： a)输出矩阵中元素的最大值及最大值所在的位置（行、列值） b)输出该矩阵的转置矩阵。 -Random number generator using a 10-row, 10 of the integer matrix. Complete the following actions: a) the output matrix elements in the location of the maximum and the max
dctcode
- B = irdct2(A) returns the two-dimensional inverse discrete cosine transform of A. The matrix B is the same size as A and contains the discrete cosine transform coefficients B(k1,k2).
marombmasimp
- 格式：x=masor(A,b,omega,x0,ep,N) A为系数矩阵，b为右端向量， 用途：用复辛普生形公式求积分。- Format: x = masor (A, b, omega, x0, ep, N) A as the coefficient matrix, b for the right-hand side vector, Uses: The complex shape Simpson quadrature formula.
matlab
- jpeg to data matrix in r,g,b
gauss-jakobi
- SOLVING A LINEAR MATRIX SYSTEM AX=B with Gauss Jordan Method
juzhen
- 用C++实现稀疏矩阵A和稀疏矩阵B的相加-Using C++, sparse matrix A and the sparse matrix B, add
Java
- 两个矩阵相乘，矩阵a的行数和矩阵b的列数必须相同，并且两个矩阵的元素具有相同或兼容的数据类型 -2 matrix multiplication, matrix a matrix of rows and columns b, must be the same, and the two elements of the matrix with the same or compatible data types
5-2
- 用三元组存放输入的两个稀疏矩阵A34和B34，将稀疏矩阵A转置后与稀疏矩阵B相乘，结果存放三元组C，并输出结果-The triples store of the two input sparse matrix A34 and B34, the sparse matrix A transpose sparse matrix B after multiplying the result stored triple C, and output
5-3
- 输入并建立两个稀疏矩阵A和B的十字链表, 输出稀疏矩阵, 两完成两稀疏矩阵的加法运算,结果存放在稀疏矩阵A中, 要求相加结果为0的元素从结果稀疏矩阵的十字链表中删除, 输出A稀疏矩阵-Input and the establishment of two sparse matrices A and B, cross linked, the output matrix, the two completed the addition of two sparse matrix computation,
yakebi
- 对线性方程组进行求解，可以从键盘上输入A和B两个矩阵，然后即返回结的结果-For solving linear equations, the keyboard input from A and B two matrix, then return and results
Gauss
- 用全选主元Gauss消去法求解线性方程组。其中a是方程组的系数矩阵，b是右端常数向量，并存放最终解向量，n是阶数。-With full pivoting Gauss elimination method for solving linear equations. Where a is the coefficient matrix, b is the right end of the constant vector, and store the final solution vector, n i
Gauss_Jordan
- 全选主元Gauss-Jordan消去法求解线性代数方程组。其中a是方程组系数矩阵，b先存右端的m组常数向量，之后存解向量。n是阶数，m是右端常数向量组数。-Select the main element Gauss-Jordan Elimination method for solving linear algebraic equations. Where a is the coefficient matrix, b right side of m pre-existing group of c
Levinson
- 采用列文逊递推算法求解对称托伯利兹型方程组。其中t存放T型矩阵的元素。b是右端常数向量。x是解向量。n是阶数。-Using Levinson recursion algorithm for symmetric Tuobolizi equations. Where t T-matrix elements of deposit. b is the right end of the constant vector. x is the solution vector. n is the order.
Strassen
- 设A 和 B 是两个n * n阶矩阵，求它们两的乘积矩阵C。这里，假设n是2的幂次方；-N*N matrix
Floyd-Matlab
- floyd算法的matlab程序 floyd-最短路问题 输入： B-邻接矩阵(bij)，指i到j之间的距离，可以是有向的。 sp- 起点标号。 ep- 终点标号。 输出： d- 最短路的距离。 path-最短路的路径。-floyd algorithm matlab program floyd-shortest path problem Input: B-adjacency matrix (bij), refers to the distan
and11
- 该程序可实现求解线性方程组的功能，采用共轭梯度法求解线性方程组Ax=b的解 线性方程组的系数矩阵-The program enables the function for solving linear equations using the conjugate gradient method for solving linear equations Ax = b the solution , the coefficient matrix of linear equations
Embiggen
- Add (or multiply, divide, etc) a matrix A to a vector b with the simple syntax A + Embiggen(b)